Two Applications of Random Spanning Forests
نویسندگان
چکیده
منابع مشابه
Spanning Forests on Random Planar Lattices
The generating function for spanning forests on a lattice is related to the q-state Potts model in a certain q → 0 limit, and extends the analogous notion for spanning trees, or dense self-avoiding branched polymers. Recent works have found a combinatorial perturbative equivalence also with the (quadratic action) O(n) model in the limit n → −1, the expansion parameter t counting the number of c...
متن کاملCritical Behaviour of Spanning Forests on Random Planar Graphs
As a follow-up of previous work of the authors, we analyse the statistical mechanics model of random spanning forests on random planar graphs. Special emphasis is given to the analysis of the critical behaviour. Exploiting an exact relation with a model of O(−2)-loops and dimers, previously solved by Kostov and Staudacher, we identify critical and multicritical loci, and find them consistent wi...
متن کاملIndistinguishability of the components of random spanning forests
We prove that the infinite components of the Free Uniform Spanning Forest (FUSF) of a Cayley graph are indistinguishable by any invariant property, given that the forest is different from its wired counterpart. Similar result is obtained for the Free Minimal Spanning Forest (FMSF). We also show that with the above assumptions there can only be 0, 1 or infinitely many components, which solves th...
متن کاملConnectivity of Random Geometric Graphs Related to Minimal Spanning Forests
The a.s. connectivity of the Euclidean minimal spanning forest MSF(X) on a homogeneous Poisson point process X ⊂ R is an open problem for dimension d > 2. We introduce a descending family of graphs (Gn)n≥2 that can be seen as approximations to the MSF in the sense that MSF(X) = ⋂∞ n=2Gn(X). For n = 2 one recovers the relative neighborhood graph or, in other words, the β-skeleton with β = 2. We ...
متن کاملSpanning Forests of a Digraph and Their Applications
We study spanning diverging forests of a digraph and related matrices. It is shown that the normalized matrix of out forests of a digraph coincides with the transition matrix in a specific observation model for Markov chains related to the digraph. Expressions are given for the Moore-Penrose generalized inverse and the group inverse of the Kirchhoff matrix. These expressions involve the matrix ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Theoretical Probability
سال: 2017
ISSN: 0894-9840,1572-9230
DOI: 10.1007/s10959-017-0771-3